Higher-Order Duality for Minimax Fractional Type Programming Involving Symmetric Matrices
نویسندگان
چکیده
Convexity and generalized convexity play important roles in optimization theory. With the development of programming problem, there has been a growing interest in the higher-order dual problem and a lot of related generalized convexities are given. In this paper, we give the convexity of ( , , , , , ) F d b vector-pseudoquasi-Type I and formulate a higher-order duality for minimax fractional type programming involving symmetric matrices, and give the weak, strong and strict converse duality theorems under the condition of higher-order ( , , , , , ) F d b vector-pseudoquasi-Type I.
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملSecond-Order Duality for Nondifferentiable Minimax Fractional Programming Involving (F, ρ)-Convexity
We focus our study to formulate two different types of second-order dual models for a nondifferentiable minimax fractional programming problem and derive duality theorems under (F, ρ)-convexity. Several results including many recent works are obtained as special cases.
متن کاملSecond-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
*Correspondence: [email protected] Department of Mathematics, University of Tabuk, Tabuk, Kingdom of Saudi Arabia Abstract In the present paper, we are concerned with second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type assumptions. The weak, strong and converse duality theorems are proved. Results obtained in this paper ext...
متن کاملHigher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions
A unified higher-order dual for a nondifferentiable minimax programming problem is formulated. Weak, strong and strict converse duality theorems are discussed involving generalized higher-order (F,α,ρ, d)-Type I functions.
متن کاملDuality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کامل